int search(int* nums, int numsSize, int target)
{
    int left = 0;
    int right = numsSize;   
    while (left < right)
    {
        int mid = left + (right - left) / 2;
        if (nums[mid] == target) 
            return mid;
        else if (nums[mid] > target )    
            right = mid;
        else 
            left = mid + 1;
    }
    return -1;
    
}